Classifying Recursive Functions
نویسنده
چکیده
منابع مشابه
Accessible recursive functions
The class of all recursive functions fails to possess a natural hierarchical structure, generated predicatively from “within”. On the other hand, many (proof-theoretically significant) sub-recursive classes do. This paper attempts to measure the limit of predicative generation in this context, by classifying and characterizing those (predictably terminating) recursive functions which can be suc...
متن کاملClassification of recursive functions into polynomial and superpolynomial complexity classes
We present a decidable and sound criterion for classifying recursive functions over higher-order data structures into polynomial and superpolynomial complexity classes generalizing the seminal results by Bellantoni and Cook [1] and Leivant [4] to complex structural datatypes. The criterion is complete for the special case of binary strings; whether it is also complete for arbitrary higherorder ...
متن کاملClassifying Recursive Predicates and Languages
We study the classi cation of recursive predicates and languages. In particular, we compare the classi cation of predicates and languages with the classi cation of arbitrary recursive functions and with learning. Moreover, we re ne our investigations by introducing classi cation with a bounded number of mind changes and establish a new hierarchy. Furthermore, we introduce multi{classi cation an...
متن کاملRecursive Estimation of Proportions in Earth Observations
In Earth observations problems, we usually have the situation of knowing accurately the probability density functions of the several classes of interest, and we need to classify a set of observations with unknown class proportions. The observations are in n-dimensional space, where n is the number of spectral bands. Two recursive algorithms for classifying the observations and estimating the pr...
متن کاملClassifying the phase transition threshold for Ackermannian functions
It is well known that the Ackermann function can be defined via diagonalization from an iteration hierarchy (of Grzegorczyk type) which is built on a start function like the successor function. In this paper we study for a given start function g iteration hierarchies with a sublinear modulus h of iteration. In terms of g and h we classify the phase transition for the resulting diagonal function...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997